Open Constraint Programming
نویسندگان
چکیده
A new model for high-level concurrent programming is presented. Designed for implementing programs which manipulate and react to shared data which is highly structured, its main elements are: a shared constraint store, deened as a theory-update system a notion of reactor, which is a program fragment written in a generic reactive programming language; a general use of agents, deened as arbitrary (possibly parallel) programs, which contain embedded reactors; a trigger model, representing an abstract architecture addressing the key implementation challenges. This paper presents a \wrapper" framework as the outermost framework toward the deenition and implementation of constraint stores and a suuciently rich set of agents. A constraint store is formalized as in traditional constraint programming as a theory with an intended model. These theories are updatable, and the update functions are available externally via reactive programs. These programs , called reactors, are used to update and synchronize with the store, and are embedded within user programs. In summary, the entire framework provides high-level reasoning on the domain of discourse via its constraint system, provides expressive synchronization and update operations via updates to the constraints, and nally, it provides exibility via the embedding of reactors in arbitrary agent programs, ie: it is an open system.
منابع مشابه
ORE extraction and blending optimization model in poly- metallic open PIT mines by chance constrained one-sided goal programming
Determination a sequence of extracting ore is one of the most important problems in mine annual production scheduling. Production scheduling affects mining performance especially in a poly-metallic open pit mine with considering the imposed operational and physical constraints mandated by high levels of reliability in relation to the obtained actual results. One of the important operational con...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملMulti-item inventory model with probabilistic demand function under permissible delay in payment and fuzzy-stochastic budget constraint: A signomial geometric programming method
This study proposes a new multi-item inventory model with hybrid cost parameters under a fuzzy-stochastic constraint and permissible delay in payment. The price and marketing expenditure dependent stochastic demand and the demand dependent the unit production cost are considered. Shortages are allowed and partially backordered. The main objective of this paper is to determine selling price, mar...
متن کاملApplication of stochastic programming for iron ore quality control
Stockpiling and blending play a major role in maintaining the quantity and quality of the raw materials fed into processing plants, especially the cement, iron ore and steel making, and coal-fired power generation industries that usually require a much uniformed feed. Due to the variable nature of such materials, they even come from the same source and the produced ores or concentrates are seld...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998